On linear combinations of Chebyshev polynomials

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Linear Combinations of Chebyshev Polynomials

a0Tn(x) + a1Tn−1(x) + · · ·+ amTn−m(x) where (a0, a1, . . . , am) is a fixed m-tuple of real numbers, a0, am 6= 0, Ti(x) are Chebyshev polynomials of the first kind, n = m, m + 1, m + 2, . . . Here we analyze the structure of the set of zeros of such polynomial, depending on A and its limit points when n tends to infinity. Also the expression of envelope of the polynomial is given. An applicati...

متن کامل

On Linear Combinations of Orthogonal Polynomials

In this expository paper, linear combinations of orthogonal polynomials are considered. Properties like orthogonality and interlacing of zeros are presented.

متن کامل

Linear Recurrences and Chebyshev Polynomials

with given a, b, t0, t1 and n ≥ 0. This sequence was introduced by Horadam [3] in 1965, and it generalizes many sequences (see [1, 4]). Examples of such sequences are Fibonacci polynomials sequence (Fn(x))n≥0, Lucas polynomials sequence (Ln(x))n≥0, and Pell polynomials sequence (Pn(x))n≥0, when one has a = x, b = t1 = 1, t0 = 0; a = t1 = x, b = 1, t0 = 2; and a = 2x, b = t1 = 1, t0 = 0; respect...

متن کامل

On integer Chebyshev polynomials

We are concerned with the problem of minimizing the supremum norm on [0, 1] of a nonzero polynomial of degree at most n with integer coefficients. We use the structure of such polynomials to derive an efficient algorithm for computing them. We give a table of these polynomials for degree up to 75 and use a value from this table to answer an open problem due to P. Borwein and T. Erdélyi and impr...

متن کامل

On Chebyshev Polynomials of Matrices

The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is uniquely defined if m is less than the degree of the minimal polynomial of A. We study general properties of Chebyshev polynomials of matrices, which in some cases turn out to be generalizations of well known propertie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Publications de l'Institut Mathematique

سال: 2015

ISSN: 0350-1302,1820-7405

DOI: 10.2298/pim150220001s